翻訳と辞書 |
Dissociation number : ウィキペディア英語版 | Dissociation number In the mathematical discipline of graph theory, a subset of vertices in a graph ''G'' is called dissociation if it induces a subgraph with maximum degree 1. The number of vertices in a maximum cardinality dissociation set in ''G'' is called the dissociation number of ''G'', denoted by diss(''G''). The problem of computing diss(''G'') (dissociation number problem) was firstly studied by Yannakakis. The problem is NP-hard even in the class of bipartite and planar graphs. == Notes ==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Dissociation number」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|